Highly irregular digraphs
نویسندگان
چکیده
منابع مشابه
Degree sequences of digraphs with highly irregular property
A digraph such that for each its vertex, vertices of the outneighbourhood have different in-degrees and vertices of the inneighbourhood have different out-degrees, will be called an HI-digraph. In this paper, we give a characterization of sequences of pairs of outand in-degrees of HI-digraphs.
متن کاملHighly Irregular Quantum Constraints
Motivated by a recent paper of Louko and Molgado, we consider a simple system with a single classical constraint R(q) = 0. If ql denotes a generic solution to R(q) = 0, our examples include cases where R(ql) 6= 0 (regular constraint) and R(ql) = 0 (irregular constraint) of varying order as well as the case where R(q) = 0 for an interval, such as a ≤ q ≤ b. Quantization of irregular constraints ...
متن کاملThe switch Markov chain for sampling irregular graphs and digraphs
The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the sampling. The switch chain is known to be rapidly mixing for regular degree sequences, both in the undirected and directed setting. We prove that the switch c...
متن کاملHighly arc-transitive digraphs – counterexamples and structure∗
We resolve two problems of [Cameron, Praeger, and Wormald – Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each ‘building block’ is a finite bipartite graph that is...
متن کاملSome constructions of highly arc-transitive digraphs
We construct infinite highly arc-transitive digraphs with finite out-valency and whose sets of descendants are digraphs which have a homomorphism onto a directed (rooted) tree. Some of these constructions are based on [4] and [5], and are shown to have universal reachability
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90134-f